Success Guarantee of Dual Search
نویسنده
چکیده
Although the Lagrangian method is a powerful dual search approach in integer programming, it often fails to identify an optimal solution of the primal problem. The p-th power Lagrangian method developed in this paper ooers a success guarantee for the dual search in generating an optimal solution of the primal integer programming problem in an equivalent setting via two key transformations. One other prominent feature of the p-th power Lagrangian method is that the dual search only involves a one-dimensional search of a scalar La-grangian multiplier within 0,1].
منابع مشابه
Plug-and-play dual-tree algorithm runtime analysis
Numerous machine learning algorithms contain pairwise statistical problems at their core— that is, tasks that require computations over all pairs of input points if implemented naively. Often, tree structures are used to solve these problems efficiently. Dual-tree algorithms can efficiently solve or approximate many of these problems. Using cover trees, rigorous worstcase runtime guarantees hav...
متن کاملImproved Deterministic Conditions for Sparse and Low-Rank Matrix Decomposition
In this paper, the problem of splitting a given matrix into sparse and low-rank matrices is investigated. The problem is when and how we can exactly do this decomposition. This problem is ill-posed in general and we need to impose some (sufficient) conditions to be able to decompose a matrix into sparse and low-rank matrices. This conditions can be categorized into two general classes: (a) dete...
متن کاملIn search of a curriculum planning model for the development of family's cultural capital and academic success of children
The aim of this research is to search for a model for the curriculum planning of the parents' cultural capital growth and to facilitate the children's Progress in school. The correlation of the parent's cultural capital dimensions with the educational achivement of the students was studied, and an efficient plan for the growth of the family's cultural capital was designed, implemented and evalu...
متن کاملInterior-point Methods for Nonconvex Nonlinear Programming: Primal-dual Methods and Cubic Regularization
In this paper, we present a primal-dual interior-point method for solving nonlinear programming problems. It employs a Levenberg-Marquardt (LM) perturbation to the Karush-Kuhn-Tucker (KKT) matrix to handle indefinite Hessians and a line search to obtain sufficient descent at each iteration. We show that the LM perturbation is equivalent to replacing the Newton step by a cubic regularization ste...
متن کاملImproving Gnutella Query Search Algorithm with Jumps
The measurement of a search algorithm for unstructured P2P network centres on the number of nodes not receiving their requested files (number of failures) and the number of hops per query. Most current search algorithms are unable to guarantee the success of the query. This study involves a comparison of the strengths and weaknesses of three algorithms of Gnutella P2P protocol, namely Flood, Ra...
متن کامل